Ramanujan's congruences and Dyson's crank.
نویسندگان
چکیده
T he achievement of Karl Mahlburg in this issue of PNAS (1) adds a lustrous chapter to a unique mathematical object: the crank. In 1944, the crank was first hinted at by Freeman Dyson (2), then an undergraduate at Cambridge University. He had written an article, titled Some Guesses in the Theory of Partitions, for Eureka, the undergraduate mathematics journal of Cambridge. Dyson discovered the many conjectures in this article by attempting to find a combinatorial explanation of Ramanujan’s famous congruences for p(n), the number of partitions of n. The three simplest of Ramanujan’s congruences assert that:
منابع مشابه
Partition congruences and the Andrews-Garvan-Dyson crank.
In 1944, Freeman Dyson conjectured the existence of a "crank" function for partitions that would provide a combinatorial proof of Ramanujan's congruence modulo 11. Forty years later, Andrews and Garvan successfully found such a function and proved the celebrated result that the crank simultaneously "explains" the three Ramanujan congruences modulo 5, 7, and 11. This note announces the proof of ...
متن کاملOn Spt-crank Type Functions
In a recent paper, Andrews, Dixit, and Yee introduced a new spt-type function spt ω (n), which is closely related to Ramanujan’s third order mock theta function ω(q). Garvan and Jennings-Shaffer introduce a crank function which explains congruences for spt ω (n). In this note, we study asymptotic behavior of this crank function and confirm a positivity conjecture of the crank asymptotically. We...
متن کاملWhat is the crank of a partition?
The crank of an integer partition is an integer statistic which yields a combinatorial explanation of Ramanujan’s three famous congruences for the partition function. The existence of such a statistic was conjectured by Freeman Dyson in 1944 and realized 44 years later by George Andrews and Frank Gravan. Since then, groundbreaking work by Ken Ono, Karl Mahlburg, and others tells us that not onl...
متن کاملCombinatorial Interpretations of Congruences for the Spt-function
Let spt(n) denote the total number of appearances of the smallest parts in all the partitions of n. In 1988, the second author gave new combinatorial interpretations of Ramanujan’s partition congruences mod 5, 7 and 11 in terms of a crank for weighted vector partitions. In 2008, the first author found Ramanujantype congruences for the spt-function mod 5, 7 and 13. We give new combinatorial inte...
متن کاملNon-existence of Ramanujan Congruences in Modular Forms of Level Four
Abstract. Ramanujan famously found congruences for the partition function like p(5n + 4) ≡ 0 (mod 5). We provide a method to find all simple congruences of this type in the coefficients of the inverse of a modular form on Γ1(4) which is non-vanishing on the upper half plane. This is applied to answer open questions about the (non)-existence of congruences in the generating functions for overpar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Proceedings of the National Academy of Sciences of the United States of America
دوره 102 43 شماره
صفحات -
تاریخ انتشار 2005